Faster quantum simulation by randomization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster than Light Quantum Communication

Faster than light communication might be possible using the collapse of the quantum wave-function without any accompanying paradoxes.

متن کامل

Faster than Hermitian quantum mechanics.

Given an initial quantum state |psi(I)> and a final quantum state |psi(F)>, there exist Hamiltonians H under which |psi(I)> evolves into |psi(F)>. Consider the following quantum brachistochrone problem: subject to the constraint that the difference between the largest and smallest eigenvalues of H is held fixed, which H achieves this transformation in the least time tau? For Hermitian Hamiltoni...

متن کامل

Faster Together: Collective Quantum Search

Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search ...

متن کامل

Robust quantum computation by simulation

Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the systems simulated. Two examples are explored, toric codes and non-abelian anyons. The latter is shown to provide universal robust quantum computation via simul...

متن کامل

Faster Quantum Number Factoring via Circuit Synthesis

A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum

سال: 2019

ISSN: 2521-327X

DOI: 10.22331/q-2019-09-02-182